Generic Tabu Search

The Multiple Sequence Alignment problem is considered to be an NP-Hard problem, requiring initially a specific encoding schema and design, as for any other of its siblings, implement run the main categories heuristic. This paper intends discuss our proposed generic implementation Tabu Search algorithm, heuristic procedure by Fred Glover solve discrete combinatorial optimization problems. In this research, we try coordinate synchronize different designs/implementations discussed in many literatures, with some references mentioned paper. basic idea avoid that search best solutions stops when local optimum found, maintaining list non-acceptable or forbidden (taboo) solutions/costs, called Short-Term Memory (STM). attempt add executions tracing functionalities order help later analysis initial parameters tuning. On hand, propose include concept Long-Term (LTM), so found far can saved, diversification.